Critical pair criteria for completion
نویسندگان
چکیده
منابع مشابه
A critical pair criterion for completion modulo a congruence
Rewrite systems axe collections of directed equations (rules) used to compute by repeatedly replacing subterms in a given formula until a simplest form possible (normal form) is obtained. Many formula manipulation systems such as REDUCE or MAGSYMA use equations for simplification in this manner. Canonical (i.e., terminating Church-Rosser) rewrite systems have the property that all equal terms (...
متن کاملRedundancy Criteria for Constrained Completion
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present several inference systems which show in a very precise way how to take advantage of redundancy notions in this framework. A notable feature of these systems is the variety of tradeo s they present for removing redundant...
متن کاملA critical-pair/completion algorithm for finitely generated ideals in rings
In 1965, the author introduced a "critical-pair/completion" algorithm that starts from a f in i te set F of polynomials in K[xl , . . . ,Xn] (K a f ield) and produces a set G of polynomials such that the ideals generated by F and G are identical, but G is in a certain standard form (G is a "Gr~bner-basis"), for which a number of important decision and computability problems in polynomial ideal ...
متن کاملStability criteria for breached-pair superfluidity.
We present simple, concrete, two-fermion models that exhibit thermodynamically stable isotropic translationally invariant gapless superfluid states (breached-pair superfluidity). The mass ratio between the components and the momentum structure of the interaction are crucial for determining the stability of such states: idealized, momentum-independent ("contact") interactions are insufficient.
متن کاملThe Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two graphs G1(V, E1) and G2(V,E2), the Homogeneous Set Sandwich Problem (HSSP) asks whether there exists a graph GS(V, ES), E1 ⊆ ES ⊆ E2, which has a homogeneous set. This paper presents an algorithm that uses the concept ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1988
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(88)80018-x